Subspace Methods for Robot Vision 1

نویسندگان

  • Shree K. Nayar
  • Sameer A. Nene
  • Hiroshi Murase
چکیده

In contrast to the traditional approach, visual recognition is formulated as one of matching appearance rather than shape. For any given robot vision task, all possible appearance variations de ne its visual workspace. A set of images is obtained by coarsely sampling the workspace. The image set is compressed to obtain a low-dimensional subspace, called the eigenspace, in which the visual workspace is represented as a continuous appearance manifold. Given an unknown input image, the recognition system rst projects the image to eigenspace. The parameters of the vision task are recognized based on the exact location of the projection on the appearance manifold. E cient algorithms for nding the closest manifold point are discussed. The proposed appearance representation has several applications in robot vision. As examples, a precise visual positioning system, a real-time visual tracking system, and a real-time temporal inspection system are described. The performance of these systems is evaluated through numerous experiments. The simplicity and generality of the proposed ideas have led to the development of a comprehensive software library for appearance modeling and matching. i

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Effective Mechatronic Models and Methods for Implementation an Autonomous Soccer Robot

  Omni directional mobile robots have been popularly employed in several applications especially in soccer player robots considered in Robocup competitions. However, Omni directional navigation system, Omni-vision system and solenoid kicking mechanism in such mobile robots have not ever been combined. This situation brings the idea of a robot with no head direction into existence, a comprehensi...

متن کامل

Robot Motion Vision Pait I: Theory

A direct method called fixation is introduced for solving the general motion vision problem, arbitrary motion relative to an arbitrary environment. This method results in a linear constraint equation which explicitly expresses the rotational velocity in terms of the translational velocity. The combination of this constraint equation with the Brightness-Change Constraint Equation solves the gene...

متن کامل

Robot Motion Vision Part II: Implementation

The idea of Fixation introduced a direct method for general recovery of shape and motion from images without using either feature correspondence or optical flow [1,2]. There are some parameters which have important effects on the performance of fixation method. However, the theory of fixation does not say anything about the autonomous and correct choice of those parameters. This paper presents ...

متن کامل

An Intelligent Vision System on a Mobile Manipulator

This article will introduce a robust vision system which was implemented on a mobile manipulator. This robot has to find objects and deliver them to pre specified locations. In the first stage, a method which is named color adjacency method was employed. However, this method needs a large amount of memory and the process is very slow on computers with small memories. Therefore since the previou...

متن کامل

Forward kinematic analysis of planar parallel robots using a neural network-based approach optimized by machine learning

The forward kinematic problem of parallel robots is always considered as a challenge in the field of parallel robots due to the obtained nonlinear system of equations. In this paper, the forward kinematic problem of planar parallel robots in their workspace is investigated using a neural network based approach. In order to increase the accuracy of this method, the workspace of the parallel robo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995